Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("Communicating sequential process")

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Language

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 186

  • Page / 8
Export

Selection :

  • and

CSP : communicating sequential processes : the first 25 years (London, 7-8 July 2004, revised invited papers)Abdallah, Ali E; Jones, Cliff B; Sanders, Jeff W et al.Lecture notes in computer science. 2005, issn 0302-9743, isbn 3-540-25813-2, XIV, 320 p, isbn 3-540-25813-2Conference Proceedings

Two complete axiom systems for a theory of communicating sequential processesDE NICOLA, R.Information and control. 1985, Vol 64, Num 1-3, pp 136-172, issn 0019-9958Article

Generic parameters in occamWILSON, G. A.Software, practice & experience. 1989, Vol 19, Num 11, pp 1057-1064, issn 0038-0644Article

Recursive process definitions with the state operatorBAETEN, J. C. M; BERGSTRA, J. A.Theoretical computer science. 1991, Vol 82, Num 2, pp 285-302, issn 0304-3975, 18 p.Article

An efficient technique for deadlock analysis of large scale process networksMARTIN, J. M. R; JASSIM, S. A.Lecture notes in computer science. 1997, pp 418-441, issn 0302-9743, isbn 3-540-63533-5Conference Paper

A compositional proof system for shared variable concurrencyDE BOER, F. S; HANNEMANN, U; DE ROEVER, W.-P et al.Lecture notes in computer science. 1997, pp 515-532, issn 0302-9743, isbn 3-540-63533-5Conference Paper

Using a PVS embedding of CSP to verify authentication protocolsDUTERTRE, B; SCHNEIDER, S.Lecture notes in computer science. 1997, pp 121-136, issn 0302-9743, isbn 3-540-63379-0Conference Paper

On communicating sequential processesPANDEY, B. D; PATHAK, S. S.Computer networks and ISDN systems. 1995, Vol 27, Num 9, pp 1333-1348, issn 0169-7552Article

Total correctness of CSP programsSOUNDARARAJAN, N.Acta informatica. 1986, Vol 23, Num 2, pp 193-215, issn 0001-5903Article

Relating may and must testing semantics for discrete timed process algebrasLLANA DIAZ, L. F; DE FRUTOS ESCRIG, D.Lecture notes in computer science. 1999, pp 74-86, issn 0302-9743, isbn 3-540-66856-XConference Paper

Implementing a model checker for LEGOYU, S; LUO, Z.Lecture notes in computer science. 1997, pp 442-458, issn 0302-9743, isbn 3-540-63533-5Conference Paper

Protocoles pour le rendez-vous et l'équité = Protocols for rendez-vous and fairnessPandolfi, Xavier; Jorrand, Philippe.1992, 97 p.Thesis

Transformations for communication fairness in CSPZÖBEL, D.Information processing letters. 1987, Vol 25, Num 3, pp 195-198, issn 0020-0190Article

Scheduling algebraVAN GLABBEEK, R; RITTGEN, P.Lecture notes in computer science. 1999, pp 278-292, issn 0302-9743, isbn 3-540-65462-3Conference Paper

Testing semantics for unbounded nondeterminismFDO, L; DIAZ, L; NUNEZ, M et al.Lecture notes in computer science. 1997, pp 538-545, issn 0302-9743, isbn 3-540-63440-1Conference Paper

CSP, partial automata, and coalgebrasWOLTER, Uwe.Theoretical computer science. 2002, Vol 280, Num 1-2, pp 3-34, issn 0304-3975Conference Paper

Communicating B machinesSCHNEIDER, Steve; TREHARNE, Helen.Lecture notes in computer science. 2002, pp 416-435, issn 0302-9743, isbn 3-540-43166-7Conference Paper

Fair bisimulationHENZINGER, T. A; RAJAMANI, S. K.Lecture notes in computer science. 2000, pp 299-314, issn 0302-9743, isbn 3-540-67282-6Conference Paper

Checking for CFFD-preorder with tester processesHELOVUO, J; VALMARI, A.Lecture notes in computer science. 2000, pp 283-298, issn 0302-9743, isbn 3-540-67282-6Conference Paper

On the evolution of reactive components : A process-algebraic approachMÜLLER-OLM, M; STEFFEN, B; CLEAVELAND, R et al.Lecture notes in computer science. 1999, pp 161-175, issn 0302-9743, isbn 3-540-65718-5Conference Paper

Abstraction and testingSCHNEIDER, S.Lecture notes in computer science. 1999, pp 738-757, issn 0302-9743, isbn 3-540-66587-0, 2VolConference Paper

Weakest-congruence results for livelock-preserving equivalencesPUHAKKA, A; VALMARI, A.Lecture notes in computer science. 1999, pp 510-524, issn 0302-9743, isbn 3-540-66425-4Conference Paper

A distributed deadlock detection algorithm for CSP-like communicationSHING-TSAAN HUANG.ACM transactions on programming languages and systems. 1990, Vol 12, Num 1, pp 102-122, issn 0164-0925, 21 p.Article

CSP-i: an implementation of communicating sequential processesWRENCH, K. L.Software, practice & experience. 1988, Vol 18, Num 6, pp 545-560, issn 0038-0644Article

Repeated Snapshots in distributed systems with synchronous communications and their implementation in CSPBOUGE, L.Theoretical computer science. 1987, Vol 49, Num 2-3, pp 145-169, issn 0304-3975Article

  • Page / 8